roach for Generalization of Real-Time Distributed Systems Benchmarking

Practically, there are endless variations of the implementation of Real-Time Distributed Systems @?TDSs).These variations are the consequences of the direrent hardware, system sojiivare architectures, and application requirements. These variations make the testing of RTDSs more implementation dependent. To the contrary benchmarking can be considered to be domain specific. Jn general any RTDS can be considered to have three scheduling domains: the node ‘s processor scheduling domain, the node 3 communication scheduling domain, and the nodes’ priority domain. The only way a benchmark would be able to integrate these three scheduling domains and also be hardware and system sojZware architecture independent, is to present itself as an application to the RTDS. From the application point of view, the RTDS can be seen as set of tasks (processes) located on d.i;ferent nodes, which communicate with each other by exchanging messages. The tasks as well the messages have timing constraints. The Hartstone Distributed Benchmark (HDB) can be viewed as an applicationoriented benchmark applicable to any type of RTDS. The HDB providesjigures of merit for the performance evaluation of the end-to-end scheduling of me:vage:.